Dynamic Partitioning of Large Multicomputer Systems
نویسنده
چکیده
We consider multiprogramming operation in large scale grid-connected multicomputer systems where the grid is spatially partitioned among the programs. We regard the problem as a two-dimensional resource allocation problem for which different algorithms are proposed. Results from simulation experiments indicate the performance that can be achieved in terms of fragmentation and throughput.
منابع مشابه
Automatic Selection of Dynamic Data Partitioning Schemes for Distributed-Memory Multicomputers
For distributed memory multicomputer such as the Intel Paragon, the IBM SP-2, the NCUBE/2, and the Thinking Machines CM-5, the quality of the data partitioning for a given application is crucial to obtaining high performance. This task has traditionally been the user's responsibility, but in recent years much effort has been directed to automating the selection of data partitioning schemes. Sev...
متن کاملPerformance Evaluation of Static and Dynamic Load Balancing Schemes for a Parallel Computational Fluid Dynamics Software (CFD) Application (FLUENT) Distributed across Clusters of Heterogeneous Symmetric Multiprocessor Systems
Computational Fluid Dynamics (CFD) applications are “highly parallelizable” and can be distributed across a cluster of computers. However, because computation time can vary with the distributed part (mesh), the system loads are unpredictable and processors can have widely different computation speeds. Load balancing (and thus computational efficiency) across a heterogeneous cluster of processor...
متن کاملDesign and Evaluation of a Method for Partitioning and Offloading Web-based Applications in Mobile Systems with Bandwidth Constraints
Computation offloading is known to be among the effective solutions of running heavy applications on smart mobile devices. However, irregular changes of a mobile data rate have direct impacts on code partitioning when offloading is in progress. It is believed that once a rate-adaptive partitioning performed, the replication of such substantial processes due to bandwidth fluctuation can be avoid...
متن کاملThe Broadcast Comparison Model for On-Line Fault Diagnosis in Multicomputer Systems
ÐThis paper describes a new comparison-based model for distributed fault diagnosis in multicomputer systems with a weak reliable broadcast capability. The classical problems of diagnosability and diagnosis are both considered under this broadcast comparison model. A characterization of diagnosable systems is given, which leads to a polynomial-time diagnosability algorithm. A polynomial-time dia...
متن کاملParallelizing Visibility Computations on Triangulated Terrains
In this paper we address the problem of computing visibility information on digital terrain models in parallel. We propose a parallel algorithm for computing the visible region of an observation point located on the terrain. The algorithm is based on a sequential triangle–sorting visibility approach proposed in [De Floriani et al. 1989]. Static and dynamic parallelization strategies, both in te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000